Cartesian product
英 [kɑːˈtiːziən ˈprɒdʌkt]
美 [kɑːrˈtiːziən ˈprɑːdʌkt]
网络 笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积
双语例句
- In this paper, a new result of Ky-Fan minimax theorem be obtained in Cartesian product H-space.
文章证明了Caresian乘积H-空间的一个新结果，并应用于ky-Fan极大极小定理的推广。 - The main results of the paper are as follows: we not only prove that the Cartesian product of graphs of path and path, path and cycle satisfies the conjecture, but also give their coloring number.
本文的主要结果如下：我们不仅证明了路与路、路与圈的笛卡尔积图满足关联色数猜想，进而确定了它们的关联色数。 - It is more efficient to execute two statements than to return a Cartesian product of the two queries which would send the customer and order information repeated for each order line.
执行两条语句与返回这两个查询的笛卡儿积相比效率要高一些，后者将重复发送每个订购项的客户信息和订单信息。 - One convex set which is Cartesian product of nonregular convex polygons is used instead of the other convex set which is Cartesian product of regular polygons.
采用不规则凸多边形的笛卡儿积构成的凸集代替正多边形的笛卡儿积构成的凸集，前者比后者更紧凑。 - The net result of the fake fact query subject will be to create a Cartesian Product for the dimensions, which returns in a shorter period of time.
伪事实查询主题的第二个作用是创建维度的笛卡尔积，它能缩短时间。 - It is proved that: ( 1) The cartesian product, the lexicographic product and the strong direct product in the products of connected graphs, are the path-positive graphs.
证明了：（1）如果G1和G2都是连通图，则积图中笛卡尔积，逻辑积和强直积都是道路正图。 - We now derive, based on the above results, sufficient conditions for a Cartesian product network.
我们现在得出，基于上述结果，有足够的条件，笛卡尔积网络。 - This method uses the hemispherical harmonics basis to represent incoming radiance and uses the Cartesian product of two hemispheres to define the BRDFs.
该方法利用半球谐基函数对入射光线正交化，利用两个半球上的笛卡儿积来定义物体表面的双向反射率分布函数。 - In this paper, we construct the product interval-valued measure and product fuzzy-valued measure on Cartesian product space, and prove the Fubini Theorem of fuzzy-valued integrals with respect to interval-valued measure and fuzzy-valued measure.
建立卡氏积空间（X×Y，S×T）上的乘积区间值测度和乘积模糊值测度，证明模糊值测度空间上模糊值函数的模糊值积分的Fubini定理。 - In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。